Exploiting Solving Phases for Mixed-Integer Programs
نویسنده
چکیده
Modern MIP solving software incorporates dozens of auxiliary algorithmic components for supporting the branch-and-bound search in finding and improving solutions and in strengthening the relaxation. Intuitively, a dynamic solving strategy with an appropriate emphasis on different solving components and strategies is desirable during the search process. We propose an adaptive solver behavior that dynamically reacts on transitions between the three typical phases of a MIP solving process: The first phase objective is to find a feasible solution. During the second phase, a sequence of incumbent solutions gets constructed until the incumbent is eventually optimal. Proving optimality is the central objective of the remaining third phase. Based on the MIP-solver SCIP, we demonstrate the usefulness of the phase concept both with an exact recognition of the optimality of a solution, and provide heuristic alternatives to make use of the concept in practice.
منابع مشابه
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have received sustained attention in recent years. By exploiting analogies to well-known techniques for solving ...
متن کاملMonoidal Cut Strengthening and Generalized Mixed-Integer Rounding for Disjunctive Programs∗
This article investigates cutting planes for mixed-integer disjunctive programs. In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. For disjunctions arising from binary variables, it is known that these cutting planes are essentially the same as Gomory mixed-integer and mixed-integer rounding cuts. In this article, we investigate ...
متن کاملPresolving Mixed-Integer Linear Programs
We survey the techniques used for presolving Mixed-integer linear programs (MILPs). Presolving is an important component of all modern MILP solvers. It is used for simplifying a given instance, for detecting any obvious problems or errors, and for identifying structures and characteristics that are useful for solving an instance.
متن کاملSolving the Installation Scheduling Problem Using Mixed Integer Linear Programming
for installing a large number of sizes and types of items (e.g., machines) over time so as to optimize some measure (e.g., initial capital investment), subject to various resource constraints. Examples of this problem are scheduling the installation of point-of-sale terminals in supermarket and retail chains, and teller terminals in banks. We have formulated the installation scheduling problem ...
متن کاملOn the Value of Binary Expansions for General Mixed-Integer Linear Programs
We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, which support our...
متن کامل